Completely Multiplicative Automatic Functions
نویسندگان
چکیده
منابع مشابه
Completely Multiplicative Automatic Functions
We show that a completely multiplicative automatic function, which dos not have 0 as value, is almost periodic.
متن کاملCompletely multiplicative functions arising from simple operations
Given two multiplicative arithmetic functions, various conditions for their convolution, powers , and logarithms to be completely multiplicative, based on values at the primes, are derived together with their applications.
متن کاملCompletely q - multiplicative functions : the Mellin transform approach
(1.1) f(aq + b) = f(aq) + f(b) or f(aq + b) = f(aq)f(b) for all r ≥ 0, a ≥ 0 and 0 ≤ b < q. Note that these equations force f(0) = 0 or f(0) = 1 respectively. These functions are called q-additive and q-multiplicative, respectively. It is easy to see that the functional equations imply that these functions are defined for all integers, when the values f(aq) are known for 1 ≤ a ≤ q − 1 and all r...
متن کاملS ep 2 00 8 COMPLETELY MULTIPLICATIVE FUNCTIONS TAKING VALUES IN { − 1 , 1 }
λ(n) := (−1). So λ(1) = λ(4) = λ(6) = λ(9) = λ(10) = 1 and λ(2) = λ(5) = λ(7) = λ(8) = −1. In particular, λ(p) = −1 for any prime p. It is well-known (e.g. See §22.10 of [7]) that Ω is completely additive, i.e, Ω(mn) = Ω(m) + Ω(n) for any m and n and hence λ is completely multiplicative, i.e., λ(mn) = λ(m)λ(n) for all m,n ∈ N. It is interesting to note that on the set of square-free positive in...
متن کاملAutomatic continuity of almost multiplicative maps between Frechet algebras
For Fr$acute{mathbf{text{e}}}$chet algebras $(A, (p_n))$ and $(B, (q_n))$, a linear map $T:Arightarrow B$ is textit{almost multiplicative} with respect to $(p_n)$ and $(q_n)$, if there exists $varepsilongeq 0$ such that $q_n(Tab - Ta Tb)leq varepsilon p_n(a) p_n(b),$ for all $n in mathbb{N}$, $a, b in A$, and it is called textit{weakly almost multiplicative} with respect to $(p_n)$ and $(q_n)$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Integers
سال: 2011
ISSN: 1867-0652
DOI: 10.1515/integ.2011.055